Strictly Level - Decreasing Logic Programs 1
نویسنده
چکیده
We study strictly level-decreasing logic programs (sld-programs) as deened earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic programs, have both a highly intuitive declarative semantics, given as a unique supported model, and are computationally adequate in the sense that every partial recursive function can be represented by some sld-program P. Allowing for a safe use of cuts, an interpreter based on SLDNF-resolution, as implemented for example in standard Prolog systems, is shown to be sound and complete with respect to this class of programs. Furthermore , we study connections between topological dynamics and logic programming which are suggested by our approach to the declarative semantics of sld-programs.
منابع مشابه
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic programs, have both a highly intuitive declarative semantics, given as a unique supported model, and are computationally adequate in the sense that every partial recursive function can be represented by some sld-program...
متن کاملSome (in)translatability results for normal logic programs and propositional theories
In this article, we compare the expressive powers of classes of normal logic programs that are obtained by constraining the number of positive subgoals (n) in the bodies of rules. The comparison is based on the existence/nonexistence of polynomial, faithful, and modular (PFM) translation functions between the classes. As a result, we obtain a strict ordering among the classes under consideratio...
متن کاملTranslation of Aggregate Programs to Normal Logic Programs
We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and stratified aggregate programs and show that the translation of such programs are, respectively, definite and stratified logic programs. Consequently these two classes of programs have a single partial stable model which is two-valued...
متن کاملPolynomially Bounded Logic Programs with Function Symbols: A New Decidable
A logic program with function symbols is called finitely ground if there is a finite propositional logic program whose stable models are exactly the same as the stable models of this program. Finite groundability is an important property for logic programs with function symbols because it makes feasible to compute such program’s stable models using traditional ASP solvers. In this paper, we int...
متن کاملTransformation Systems and
Program transformation systems are applied both in program synthesis and in program optimization. For logic programs the \logic" component makes transformations very natural and easy to be studied formally. But, when we move to Prolog programs, the \control" component cannot be ignored. In particular we need to cope with termination properties which are essential for ensuring the reachability o...
متن کامل